On a conjecture of Erdős, Graham and Spencer
نویسندگان
چکیده
منابع مشابه
On a conjecture of Erdös, Graham and Spencer, II
It is conjectured by Erdős, Graham and Spencer that if 1 ≤ a1 ≤ a2 ≤ · · · ≤ as are integers with ∑s i=1 1/ai < n − 1/30, then this sum can be decomposed into n parts so that all partial sums are ≤ 1. This is not true for ∑s i=1 1/ai = n − 1/30 as shown by a1 = · · · = an−2 = 1, an−1 = 2, an = an+1 = 3, an+2 = · · · = an+5 = 5. In 1997 Sandor proved that Erdős–Graham–Spencer conjecture is true ...
متن کاملA Counterexample to a Conjecture of Erdös, Graham and Spencer
It is conjectured by Erdős, Graham and Spencer that if 1 ≤ a1 ≤ a2 ≤ · · · ≤ as with ∑s i=1 1/ai < n − 1/30, then this sum can be decomposed into n parts so that all partial sums are ≤ 1. In this note we propose a counterexample which gives a negative answer to this conjecture.
متن کاملOn a conjecture of Butler and Graham
In this paper we prove a conjecture of Bulter and Graham [2] on the existence of a certain way of marking the lines in [k] for any prime k. The conjecture states that there exists a way of marking each line of [k] one point so that every point in [k] is marked exactly a or b times as long as the parameters (a, b, n, k) satisfy the condition that there are integers s, t such that s + t = k and a...
متن کاملNote on a conjecture of Graham
An old conjecture of Graham stated that if [Formula: see text] is a prime and [Formula: see text] is a sequence of [Formula: see text] terms from the cyclic group [Formula: see text] such that all (nontrivial) zero-sum subsequences have the same length, then [Formula: see text] must contain at most two distinct terms. In 1976, Erdős and Szemerédi gave a proof of the conjecture for sufficiently ...
متن کاملAdjusting a conjecture of Erdős
We investigate a conjecture of Paul Erdős, the last unsolved problem among those proposed in his landmark paper [2]. The conjecture states that there exists an absolute constant C > 0 such that, if v1, . . . , vn are unit vectors in a Hilbert space, then at least C 2 n of all ∈ {−1, 1} are such that | Pn i=1 ivi |≤ 1. We disprove the conjecture. For Hilbert spaces of dimension d > 2, the counte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 2006
ISSN: 0022-314X
DOI: 10.1016/j.jnt.2005.11.003